Search results for "Probabilistic analysis of algorithms"
showing 10 items of 21 documents
Path Integral Methods for the Probabilistic Analysis of Nonlinear Systems Under a White-Noise Process
2020
Abstract In this paper, the widely known path integral method, derived from the application of the Chapman–Kolmogorov equation, is described in details and discussed with reference to the main results available in literature in several decades of contributions. The most simple application of the method is related to the solution of Fokker–Planck type equations. In this paper, the solution in the presence of normal, α-stable, and Poissonian white noises is first discussed. Then, application to barrier problems, such as first passage problems and vibroimpact problems is described. Further, the extension of the path integral method to problems involving multi-degrees-of-freedom systems is anal…
A method for the probabilistic analysis of nonlinear systems
1995
Abstract The probabilistic description of the response of a nonlinear system driven by stochastic processes is usually treated by means of evaluation of statistical moments and cumulants of the response. A different kind of approach, by means of new quantities here called Taylor moments, is proposed. The latter are the coefficients of the Taylor expansion of the probability density function and the moments of the characteristic function too. Dual quantities with respect to the statistical cumulants, here called Taylor cumulants, are also introduced. Along with the basic scheme of the method some illustrative examples are analysed in detail. The examples show that the proposed method is an a…
A comprehensive probabilistic analysis of approximate SIR‐type epidemiological models via full randomized discrete‐time Markov chain formulation with…
2020
Spanish Ministerio de Economia y Competitividad, Grant/Award Number: MTM2017-89664-P; Generalitat Valenciana, Grant/Award Number: APOSTD/2019/128; Ministerio de Economia y Competitividad, Grant/Award Number: MTM2017-89664-P
Ultrametric Vs. Quantum Query Algorithms
2014
Ultrametric algorithms are similar to probabilistic algorithms but they describe the degree of indeterminism by p-adic numbers instead of real numbers. This paper introduces the notion of ultrametric query algorithms and shows an example of advantages of ultrametric query algorithms over deterministic, probabilistic and quantum query algorithms.
A Probabilistic Approach to the Count-To-Infinity Problem in Distance-Vector Routing Algorithms
2013
Count-to-infinity problem is characteristic for routing algorithms based on the distributed implementation of the classical Bellman-Ford algorithm. In this paper a probabilistic solution to this problem is proposed. It is argued that by the use of a Bloom Filter added to the routing message the routing loops will with high probability not form. An experimental analysis of this solution for use in Wireless Sensor Networks in practice is also included.
A Probabilistic Analysis to Quantify the Effect of March 11, 2004, Attacks in Madrid on the March 14 Elections in Spain: A Dynamic Modelling Approach
2015
[EN] The bomb attacks in Madrid three days before the general elections of March 14, 2004, and their possible influence on the victory of PSOE (Spanish Workers Socialist Party), defeating PP (Popular Party), have been a matter of study from several points of view (i.e., sociological, political, or statistical). In this paper, we present a dynamic model based on a system of differential equations such that it, using data from Spanish CIS (National Center of Sociological Research), describes the evolution of voting intention of the Spanish people over time. Using this model, we conclude that the probability is very low that the PSOE would have won had the attack not happened.Moreover, after t…
Probabilistic Logic under Coherence: Complexity and Algorithms
2005
In previous work [V. Biazzo, A. Gilio, T. Lukasiewicz and G. Sanfilippo, Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in System P, Journal of Applied Non-Classical Logics 12(2) (2002) 189---213.], we have explored the relationship between probabilistic reasoning under coherence and model-theoretic probabilistic reasoning. In particular, we have shown that the notions of g-coherence and of g-coherent entailment in probabilistic reasoning under coherence can be expressed by combining notions in model-theoretic probabilistic reasoning with concepts from default reasoning. In this paper, we continue this line of research. Based on the above sem…
A probabilistic rainfall model to estimate the leading-edge lifetime of wind turbine blade coating system
2021
Rain-induced leading-edge erosion of wind turbine blades is associated with high repair and maintenance costs. For efficient operation and maintenance, erosion models are required that provide estimates of blade coating lifetime at a real scale. In this study, a statistical rainfall model is established that describes probabilistic distributions of rain parameters that are critical for site-specific leading-edge erosion assessment. A new droplet size distribution (DSD) is determined based on two years’ onshore rainfall data of an inland site in the Netherlands and the obtained DSD is compared with those from the literature. Joint probability distribution functions of rain intensities and dr…
CN2-R: Faster CN2 with randomly generated complexes
2011
Among the rule induction algorithms, the classic CN2 is still one of the most popular ones; a great amount of enhancements and improvements to it is to witness this. Despite the growing computing capacities since the algorithm was proposed, one of the main issues is resource demand. The proposed modification, CN2-R, substitutes the star concept of the original algorithm with a technique of randomly generated complexes in order to substantially improve on running times without significant loss in accuracy.
Quasi conjunction, quasi disjunction, t-norms and t-conorms: Probabilistic aspects
2013
We make a probabilistic analysis related to some inference rules which play an important role in nonmonotonic reasoning. In a coherence-based setting, we study the extensions of a probability assessment defined on $n$ conditional events to their quasi conjunction, and by exploiting duality, to their quasi disjunction. The lower and upper bounds coincide with some well known t-norms and t-conorms: minimum, product, Lukasiewicz, and Hamacher t-norms and their dual t-conorms. On this basis we obtain Quasi And and Quasi Or rules. These are rules for which any finite family of conditional events p-entails the associated quasi conjunction and quasi disjunction. We examine some cases of logical de…